Certified DQBF Solving by Definition Extraction
نویسندگان
چکیده
We propose a new decision procedure for dependency quantified Boolean formulas (DQBFs) that uses interpolation-based definition extraction to compute Skolem functions in counter-example guided inductive synthesis (CEGIS) loop. In each iteration, family of candidate is tested correctness using SAT solver, which either determines model has been found, or returns an assignment the universal variables as counterexample. Fixing counterexample generally involves changing candidates multiple existential with incomparable sets. Our introduces auxiliary variables—which we call arbiter variables—that represent value variable particular its set. Possible repairs are expressed clauses on these variables, and solver invoked find deals all previously seen counterexamples. Arbiter define values assignments where they were undefined, may lead detection further by extraction. A key feature proposed it certifying design: true DQBF, models can be returned at minimal overhead. Towards certification false formulas, prove derived expansion-based proof system DQBF. experimental evaluation standard benchmark sets, prototype implementation was able match (and some cases, surpass) performance state-of-the-art-solvers. Moreover, could extracted validated instances solved.
منابع مشابه
iDQ: Instantiation-Based DQBF Solving
Dependency Quantified Boolean Formulas (DQBF) are obtained by adding Henkin quantifiers to Boolean formulas and have seen growing interest in the last years. Since deciding DQBF is NExpTime-complete, efficient ways of solving it would have many practical applications. Still, there is only few work on solving this kind of formulas in practice. In this paper, we present an instantiation-based tec...
متن کاملA DPLL Algorithm for Solving DQBF
Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin quantifiers to Boolean logic. We are not aware of any published attempt in solving this class of formulas in practice. However with DQBF being NEXPTIME-complete, efficient ways of solving it would have many practical applications. In this paper we describe a DPLL-sty...
متن کاملIndustrial-Strength Formally Certified SAT Solving
Boolean Satisfiability (SAT) solvers are now routinely used in the verification of large industrial problems. However, their application in safety-critical domains such as the railways, avionics, and automotive industries requires some form of assurance for the results, as the solvers can (and sometimes do) have bugs. Unfortunately, the complexity of modern, highly optimized SAT solvers renders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-80223-3_34